Graphs associated with orthogonal collections of k-planes over finite fields
نویسندگان
چکیده
We study graphs coming from quadratic spaces over finite fields which generalize a recent result given by Bishnoi, Ihringer, and Pepe (2020). More precisely, we the graph Γ□(n,k,q) defined as follows: vertex set is of k-dimensional subspaces fixed space (Fqn,x12+⋯+xn−12+λxn2) isometrically isomorphic to x12+⋯+xk2. Here λ non-square in Fq, two vertices x,y are adjacent if x⊆y⊥.
منابع مشابه
Sets with many pairs of orthogonal vectors over finite fields
Let n be a positive integer and B be a non-degenerate symmetric bilinear form over Fq , where q is an odd prime power and Fq is the finite field with q elements. We determine the largest possible size of a subset S of Fq such that |{B(x,y) |x,y ∈ S and x 6= y}| = 1. We also pose some conjectures concerning nearly orthogonal subsets of Fq where a nearly orthogonal subset T of Fq is a set of vect...
متن کاملFunctional graphs of polynomials over finite fields
Given a function f in a finite field IFq we define the functional graph of f as a directed graph on q nodes labelled by elements of IFq where there is an edge from u to v if and only if f(u) = v. We obtain some theoretic estimates on the number of non-isomorphic graphs generated by all polynomials of a given degree. We then develop an algorithm to test the isomorphism of quadratic polynomials t...
متن کاملMaximal integral point sets in affine planes over finite fields
Motivated by integral point sets in the Euclidean plane, we consider integral point sets in affine planes over finite fields. An integral point set is a set of points in the affine plane F2q over a finite field Fq, where the formally defined squared Euclidean distance of every pair of points is a square in Fq. It turns out that integral point sets over Fq can also be characterized as affine poi...
متن کاملToroidal queens graphs over finite fields
For each positive integer n, the toroidal queens graph may be described as a graph with vertex set Zn × Zn where every vertex is adjacent to those vertices in the directions (1, 0), (0, 1), (1, 1), (1,−1) from it. We here extend this idea, examining graphs with vertex set F × F , where F is a finite field, and any four directions are used to define adjacency. The automorphism groups and isomorp...
متن کاملAlgebraic Cayley graphs over finite fields
Article history: Received 6 April 2013 Received in revised form 23 January 2014 Accepted 25 January 2014 Available online xxxx Communicated by Igor Shparlinski MSC: 11L40 05C75 05C50
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2021
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2021.112496